Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Hybrid precoding scheme based on improved particle swarm optimization algorithm in mmWave massive MIMO system
LI Renmin, HUANG Jinsong, CHEN Chen, WU Junqin
Journal of Computer Applications    2018, 38 (8): 2365-2369.   DOI: 10.11772/j.issn.1001-9081.2017123026
Abstract777)      PDF (803KB)(391)       Save
To address the problem that the hybrid precoding scheme based on traditional Particle Swarm Optimization (PSO) algorithm in millimeter Wave (mmWave) massive Multi-Input Multi-Output (MIMO) systems has a low convergence speed and is easy to fall into the local optimal value in the later iteration, a hybrid precoding scheme based on improved PSO algorithm was proposed. Firstly, the particles' position vector and velocity vector were initialized randomly, and the initial swarm optimal position vector was given by maximizing the system sum rate. Secondly, the position vector and velocity vector were updated, and two updated particles' individual-historical-best position vectors were randomly selected to get their weighted sum as the new individual-historical-best position vector, and then some of particles that maximized the system sum rate were picked out. The weighted average value of the individual-historical-best position vectors of these particles was taken as the new swarm optimal position vector and compared with the previous one. After many iterations, the final swarm optimal position vector was formed, which was the desired best hybrid precoding vector. The simulation results show that compared with the hybrid precoding scheme based on traditional PSO algorithm, the proposed scheme is optimized both in terms of convergence speed and sum rate. The convergence speed of the proposed scheme is improved by 100%, and its performance can reach 90% of the full digital precoding scheme. Therefore, the proposed scheme can effectively improve system performance and accelerate convergence.
Reference | Related Articles | Metrics
Quantum secret sharing of arbitrary N-qubit via entangled state
WU Junqin, LIN Huiying
Journal of Computer Applications    2015, 35 (2): 397-400.   DOI: 10.11772/j.issn.1001-9081.2015.02.0397
Abstract441)      PDF (687KB)(449)       Save

Focused on the issue that the quantum secret sharing is limited to the maximally entangled state, a scheme for quantum state sharing of an arbitrary unknown N-qubit state by using entangled state as quantum channel was proposed. The sender Alice used the Bell basis measurement and then the receiver Bob or Charlie used the single particle measurement. The participants chose the right joint unitary operation according to the results from Alice and the signal measurement, which could realize arbitrary N-qubit secret sharing. The eavesdropping analysis shows explicitly that the scheme is secure and it can resist the external eavesdropper and internal dishonest participant.

Reference | Related Articles | Metrics